Yet another optimal algorithm for 3-edge-connectivity

Yet Another System For Algorithm

Yet Another Induction Algorithm

Inducing general functions from specific training examples is a central problem in the machine learning. Using sets of If-then rules is the most expressive and readable manner. To find If-then rules, many induction algorithms such as ID3, AQ, CN2 and their variants, were proposed. Sequential covering is the kernel technique of them. To avoid testing all possible selectors, Entropy gain is used ...

Yet Another Efficient Unification Algorithm

The unification algorithm is at the core of the logic programming paradigm, the first unification algorithm being developed by Robinson [5]. More efficient algorithms were developed later [4] and I introduce here yet another efficient unification algorithm centered on a specific data structure, called the Unification Table.

Yet Another Ideal Decomposition Algorithm

The problem of decomposing an ideal into pure-dimensional components (resp. reduced pure-dimensional components) is a key step in several basic algorithms of commutative algebra. The computation of the radical can be performed as intersection of the reduced components (but we wonder why you should really perform this intersection that throws away additional insight in the structure of the ideal...

Yet another bidirectional algorithm for shortest paths

For finding a shortest path in a network the bidirectional A* algorithm is a widely known algorithm. An A* instance requires a heuristic estimate, a real-valued function on the set of nodes. The version of bidirectional A* that is considered the most appropriate in literature hitherto, uses so-called balanced heuristic estimates. This means that the two estimates of the two directions are in ba...